Symmetry-breaking Answer Set Solving
نویسندگان
چکیده
In the context of Answer Set Programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive logic programs to a coloured digraph such that permutational symmetries can be constructed from graph automorphisms. Symmetries are then broken by introducing symmetry-breaking constraints. For this purpose, we formulate a preprocessor that integrates a graph automorphism system. Experiments demonstrate its computational impact.
منابع مشابه
BreakID: Static Symmetry Breaking for ASP (System Description)
Symmetry breaking has been proven to be an efficient preprocessing technique for satisfiability solving (SAT). In this paper, we port the state-of-the-art SAT symmetry breaker BreakID to answer set programming (ASP). The result is a lightweight tool that can be plugged in between the grounding and the solving phases that are common when modelling in ASP. We compare our tool with sbass, the curr...
متن کاملSymmetry Breaking for Answer Set Programming
In the context of answer set programming, this work investigates symmetry detection and symmetry breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We contribute a reduction of symmetry detection to a graph automorphism problem which allows to extract symmetries of a logic program from the symmetries of the constructed coloured graph. The corr...
متن کاملPartner Units Revisited ?
The Partner Units Problem is a challenging combinatorial search problem that has applications in the domains of security and surveillance. In this work we look at problem-specific implied constraints, search strategies and symmetry breaking approaches. We discuss the modelling and solving techniques offered by SAT solvers and answer set programming on the one hand, and constraint solvers on the...
متن کاملOn local domain symmetry for model expansion
Symmetry in combinatorial problems is an extensively studied topic. We continue this research in the context of model expansion problems, with the aim of automating the workflow of detecting and breaking symmetry. We focus on local domain symmetry, which is induced by permutations of domain elements, and which can be detected on a first-order level. As such, our work is a continuation of the sy...
متن کاملApproaches to Conditional Symmetry Breaking
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically, the condition is a set of assignments of values to variables, i.e. a partial assignment reached during systematic search. Like unconditional symmetry, conditional symmetry can cause redundancy in a systematic search f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- AI Commun.
دوره 24 شماره
صفحات -
تاریخ انتشار 2011